leading coefficients

См. также в других словарях:

• Hilbert's basis theorem — In mathematics, Hilbert s basis theorem states that every ideal in the ring of multivariate polynomials over a field is finitely generated. This can be translated into algebraic geometry as follows: every algebraic set over a field can be… …   Wikipedia

• General number field sieve — In number theory, the general number field sieve (GNFS) is the most efficient classical algorithm known for factoring integers larger than 100 digits. Heuristically, its complexity for factoring an integer n (consisting of log2 n bits) is of …   Wikipedia

• Secondary measure — In mathematics, the secondary measure associated with a measure of positive density ho when there is one, is a measure of positive density mu, turning the secondary polynomials associated with the orthogonal polynomials for ho into an orthogonal… …   Wikipedia

• Greatest common divisor of two polynomials — Informally, the greatest common divisor (GCD) of two polynomials p ( x ) and q ( x ) is the biggest polynomial that divides evenly into both p ( x ) and q ( x ). The definition is modeled on the concept of the greatest common divisor of two… …   Wikipedia

• Schinzel's hypothesis H — In mathematics, Schinzel s hypothesis H is a very broad generalisation of conjectures such as the twin prime conjecture. It aims to define the maximum possible scope of a conjecture of the nature that a family : fi ( n )of values of irreducible… …   Wikipedia

• Bateman-Horn conjecture — In number theory, the Bateman Horn conjecture is a vast generalization of such conjectures as the Hardy and Littlewood conjecture on the density of twin primes or their conjecture on primes of the form n 2+1; it is also a strengthening of… …   Wikipedia

• Limit of a function — x 1 0.841471 0.1 0.998334 0.01 0.999983 Although the function (sin x)/x is not defined at zero, as x becomes closer and closer to zero, (sin x)/x becomes arbitrarily close to 1. It is said that the limit of (sin x)/x as x approache …   Wikipedia

• Sturm's theorem — In mathematics, Sturm s theorem is a symbolic procedure to determine the number of distinct real roots of a polynomial. It was named for Jacques Charles François Sturm, though it had actually been discovered by Jean Baptiste Fourier; Fourier s… …   Wikipedia

• Asymptote — For other uses, see Asymptote (disambiguation). The graph of a function with a horizontal, vertical, and oblique asymptote …   Wikipedia

• Wilson's theorem — In mathematics, Wilson s theorem states that a natural number n > 1 is a prime number if and only if (see factorial and modular arithmetic for the notation). Contents 1 History 2 Proofs …   Wikipedia

• CMAC — This article is about the cyptographic construction. For other uses, see CMAC (disambiguation). In cryptography, CMAC (Cipher based MAC)[1] is a block cipher based message authentication code algorithm. It may be used to provide assurance of the… …   Wikipedia